Interior point method - PDFSEARCH.IO - Document Search Engine

Interior point method
Results: 87

#	Item
21	The integration of interior-point methods, decomposition concepts and branch-and-bound to solve large scale MIPs Samir Elhedhli Faculty of Management, McGill University 1001 Sherbrooke Street West Montreal, QC, H3A 1G5 Add to Reading List Source URL: www.cors.ca Language: English - Date: 2014-12-10 12:16:01 Combinatorial optimization Mathematics Convex optimization Cutting-plane method Linear programming Branch and price Cutting stock problem Relaxation Interior point method Mathematical optimization Numerical analysis Operations research
22	An SDP Primal-Dual Algorithm for Approximating the Lov´asz-Theta Function T-H. Hubert Chan Kevin L. Chang Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2009-07-14 11:31:39 Operations research Graph theory Linear programming Mathematical optimization Convex optimization Semidefinite programming Duality Interior point method Graph coloring Mathematics Theoretical computer science Applied mathematics
23	IntervalRank — Isotonic Regression with Listwise and Pairwise Constraints ∗ Taesup Moon, Alex Smola , Yi Chang, Zhaohui Zheng Yahoo! Labs Add to Reading List Source URL: www.wsdm-conference.org Language: English - Date: 2009-12-30 01:26:32 Convex optimization Machine learning Operations research Information retrieval Learning to rank Gradient boosting Lagrange multiplier Supervised learning Interior point method Mathematical optimization Numerical analysis Mathematical analysis
24	MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com On a Multiplicative Update Dual Optimization Algorithm for Constrained Linear MPC Add to Reading List Source URL: www.merl.com Language: English - Date: 2014-01-13 13:08:50 Model predictive control Quadratic programming Optimal control Convex optimization Interior point method Control theory Mathematical optimization Numerical analysis Mathematical analysis
25	MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Greedy Sparsity-Constrained Optimization Bahmani, S.; Raj, B.; Boufounos, P.T. Add to Reading List Source URL: www.merl.com Language: English - Date: 2013-07-15 07:04:10 Econometrics Mathematical optimization Least squares Interior point method Linear regression Gradient descent Sparse approximation Orthant-wise limited-memory quasi-Newton Statistics Numerical analysis Regression analysis
26	ROBERT J. VANDERBEI Operations Research and Financial Engineering [removed] www.princeton.edu/∼rvdb Add to Reading List Source URL: www.princeton.edu Language: English - Date: 2015-01-02 12:04:40 Applied mathematics Robert J. Vanderbei Robust optimization Linear programming Semidefinite programming Optimal control Mathematical Programming Society for Industrial and Applied Mathematics Interior point method Mathematical optimization Operations research Mathematics
27	Robust minimum volume ellipsoids and higher-order polynomial level sets Amir Ali Ahmadi ORFE Department Princeton University Add to Reading List Source URL: www.opt-ml.org Language: English - Date: 2014-12-10 11:28:28 Operations research Robust statistics Linear programming Convex optimization Interior point method Ellipsoid Outlier Sparse approximation RANSAC Statistics Mathematical optimization Mathematics
28	STAT 538 Homework 6 Out February 26, 2015 Due Tuesday, March 5, 2015 c Marina Meil˘a Add to Reading List Source URL: www.stat.washington.edu Language: English - Date: 2015-03-01 17:22:29 Statistical classification Operations research Machine learning Convex optimization Support vector machines Stochastic gradient descent Mathematical optimization Interior point method Duality Algebra Mathematics Statistics
29	Accelerated Training of Max-Margin Markov Networks with Kernels Xinhua Zhang∗ Department of Computing Science, University of Alberta, Edmonton, AB T6G2E8, Canada Ankan Saha Add to Reading List Source URL: users.cecs.anu.edu.au Language: English - Date: 2013-02-25 19:29:17 Convex optimization Linear programming Convex analysis Operations research Duality Bregman divergence Vector space Convex function Interior point method Mathematical optimization Mathematics Algebra
30	Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization Jacob Abernethy Computer Science Division UC Berkeley [removed] Add to Reading List Source URL: web.eecs.umich.edu Language: English - Date: 2013-10-28 18:03:14 Mathematics Convex optimization Interior point method Linear programming Self-concordant function Distribution Mathematical analysis Mathematical optimization Operations research